Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
نویسندگان
چکیده
منابع مشابه
Orthogonal Matching Pursuit under the Restricted Isometry Property
This paper is concerned with the performance of Orthogonal Matching Pursuit (OMP) algorithms applied to a dictionary D in a Hilbert space H. Given an element f ∈ H, OMP generates a sequence of approximations fn, n = 1, 2, . . ., each of which is a linear combination of n dictionary elements chosen by a greedy criterion. It is studied whether the approximations fn are in some sense comparable to...
متن کاملA Sharp Restricted Isometry Constant Bound of Orthogonal Matching Pursuit
We shall show that if the restricted isometry constant (RIC) δs+1(A) of the measurement matrix A satisfies δs+1(A) < 1 √ s+ 1 , then the greedy algorithm Orthogonal Matching Pursuit(OMP) will succeed. That is, OMP can recover every s-sparse signal x in s iterations from b = Ax. Moreover, we shall show the upper bound of RIC is sharp in the following sense. For any given s ∈ N, we shall construc...
متن کاملm at h . N A ] 1 5 Ju n 20 15 Orthogonal Matching Pursuit under the Restricted Isometry Property ∗
This paper is concerned with the performance of Orthogonal Matching Pursuit (OMP) algorithms applied to a dictionary D in a Hilbert space H. Given an element f ∈ H, OMP generates a sequence of approximations fn, n = 1, 2, . . ., each of which is a linear combination of n dictionary elements chosen by a greedy criterion. It is studied whether the approximations fn are in some sense comparable to...
متن کاملImproved Bounds on the Restricted Isometry Constant for Orthogonal Matching Pursuit
In this letter, we first construct a counter example to show that for any given positive integer K ≥ 2 and for any 1 √ K+1 ≤ t < 1, there always exist a K−sparse x and a matrix A with the restricted isometry constant δK+1 = t such that the OMP algorithm fails in K iterations. Secondly, we show that even when δK+1 = 1 √ K+1 , the OMP algorithm can also perfectly recover every K−sparse vector x f...
متن کاملA Generalized Restricted Isometry Property
Compressive Sampling (CS) describes a method for reconstructing high-dimensional sparse signals from a small number of linear measurements. Fundamental to the success of CS is the existence of special measurement matrices which satisfy the so-called Restricted Isometry Property (RIP). In essence, a matrix satisfying RIP is such that the lengths of all sufficiently sparse vectors are approximate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2054653